Comparative Performance Study of CPU Scheduling Algorithms
نویسنده
چکیده
Some CPU scheduling algorithms such as First-Come-First-Serve (FCFS), Shortest Job First (SJF), Priority, Round Robin (R-R), Multilevel Queue(MQ) and Multilevel Feedback Queue (MFQ has been elaborated and assessed on the basic CPU scheduling objectives i.e.; average waiting(AWT), average turnaround (ATT)and average response time(ART), average CPU utilization (AU)and average throughput(AT). These will form the base parameters in making a decision for the suitability of the given algorithm for a given objective. Comparative performance study of various CPU scheduling algorithm is done in this review paper. Keywords— Scheduling algorithm; First-Come-First-Serve scheduling; Shortest Job First scheduling; Priority scheduling; Round Robin scheduling; Multilevel Queue scheduling; Multilevel Feedback Queue scheduling
منابع مشابه
A Comparative Study of CPU Scheduling Algorithms
Developing CPU scheduling algorithms and understanding their impact in practice can be difficult and time consuming due to the need to modify and test operating system kernel code and measure the resulting performance on a consistent workload of real applications. As processor is the important resource, CPU scheduling becomes very important in accomplishing the operating system (OS) design goal...
متن کاملThree Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint
Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...
متن کاملA Comprehensive Study of Several Meta-Heuristic Algorithms for Open-Pit Mine Production Scheduling Problem Considering Grade Uncertainty
It is significant to discover a global optimization in the problems dealing with large dimensional scales to increase the quality of decision-making in the mining operation. It has been broadly confirmed that the long-term production scheduling (LTPS) problem performs a main role in mining projects to develop the performance regarding the obtainability of constraints, while maximizing the whole...
متن کاملPerformance Analysis of CPU Scheduling Algorithms with Novel OMDRRS Algorithm
CPU scheduling is one of the most primary and essential part of any operating system. It prioritizes processes to efficiently execute the user requests and help in choosing the appropriate process for execution. Round Robin (RR) & Priority Scheduling(PS) are one of the most widely used and acceptable CPU scheduling algorithm. But, its performance degrades with respect to turnaround time, waitin...
متن کاملA multi-objective resource-constrained optimization of time-cost trade-off problems in scheduling project
This paper presents a multi-objective resource-constrained project scheduling problem with positive and negative cash flows. The net present value (NPV) maximization and making span minimization are this study objectives. And since this problem is considered as complex optimization in NP-Hard context, we present a mathematical model for the given problem and solve three evolutionary algorithms;...
متن کامل